Select-divide-and-conquer method for large-scale configuration interaction
نویسندگان
چکیده
منابع مشابه
Reduced Complexity Divide and Conquer Algorithm for Large Scale TSPs
The Traveling Salesman Problem (TSP) is the problem of finding the shortest path passing through all given cities while only passing by each city once and finishing at the same starting city. This problem has NP-hard complexity making it extremely impractical to get the most optimal path even for problems as small as 20 cities since the number of permutations becomes too high. Many heuristic me...
متن کاملA divide-and-conquer linear scaling three-dimensional fragment method for large scale electronic structure calculations
We present a new linear scaling ab initio total energy electronic structure calculation method based on a divide-and-conquer strategy. This method is simple to implement, easy to parallelize, and produces accurate results when compared with direct ab initio methods. The new method has been tested on nanosystems with up to 15 000 atoms using up to 8000 processors. (Some figures in this article a...
متن کاملApplying Divide and Conquer to Large Scale Pattern Recognition Tasks
Rather than presenting a speciic trick, this paper aims at providing a methodology for large scale, real-world classiication tasks involving thousands of classes and millions of training patterns. Such problems arise in speech recognition, handwriting recognition and speaker or writer identiication, just to name a few. Given the typically very large number of classes to be distinguished, many a...
متن کاملA A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization
This paper proposes a competitive divide-and-conquer algorithm for solving large-scale black-box optimization problems, where there are thousands of decision variables, and the algebraic models of the problems are unavailable. We focus on problems that are partially additively separable, since this type of problem can be further decomposed into a number of smaller independent sub-problems. The ...
متن کاملAn SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
We propose the DISCO algorithm for graph realization in Rd, given sparse and noisy short-range inter-vertex distances as inputs. Our divide-and-conquer algorithm works as follows. When a group has a sufficiently small number of vertices, the basis step is to form a graph realization by solving a semidefinite program. The recursive step is to break a large group of vertices into two smaller grou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2006
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.2207621